Programming with Functional Nets
نویسنده
چکیده
Over the last 20 years an operational view of program execution based on rewriting has become widespread. In this view, a program is seen as a term in some calculus, and program execution is modeled by stepwise rewriting of the term according to the rules of the calculus. The operational semantics still has to be complemented with a logic for program verification and a collection of laws of programming. This view is exemplified in functional programming [4, 17], in modern theories of objects [1], as well as in concurrent systems based on message passing such as CSP [15], CCS [19] or π-calculus [20].
منابع مشابه
Functional Nets
Functional nets combine key ideas of functional programming and Petri nets to yield a simple and general programming notation. They have their theoretical foundation in Join calculus. This paper presents functional nets, reviews Join calculus, and shows how the two relate.
متن کاملAn Overview of Functional Nets
Functional nets combine key ideas of functional programming and Petri nets to yield a simple and general programming notation. They have their theoretical foundation in Join calculus. This paper gives an overview of functional nets as a kernel programming language, it presents an object-based version of Join calculus, and it shows how the two relate. Over the last decades an operational view of...
متن کاملVisual Programming with Recursion Patterns in Interaction Nets
In this paper we propose to use Interaction Nets as a formalism for Visual Functional Programming. We consider the use of recursion patterns as a programming idiom, and introduce a suitable archetype/instantiation mechanism for interaction agents, which allows one to define agents whose behaviour is based on recursion patterns.
متن کاملFunctional Programming and Program Transformation with Interaction Nets
In this paper we propose to use Interaction Nets as a formalism for Visual Functional Programming. We consider the use of recursion patterns and introduce a suitable archetype/instantiation mechanism for interaction agents. We also consider program transformation by fusion, a well-known transformation technique, and show that this extends smoothly to our visual programming framework. Examples o...
متن کاملTool Support for Haskell-Coloured Petri Nets
Haskell-Coloured Petri Nets (HCPNs) are one instance of a class of high-level Petri Nets which combines graphical description of concurrent system structure (causal dependencies, concurrency, conflict over shared resources, data transport) with functional specification of data manipulation. In an earlier paper [6], we introduced HCPN to demonstrate how any functional language supporting a few c...
متن کاملComposition of Functional Petri Nets
Functional Petri nets and subnets are introduced and studied for the purpose of speed-up of Petri nets analysis with algebraic methods. The authors show that any functional subnet may be generated by a composition of minimal functional subnets. They propose two ways to decompose a Petri net: via logical equations solution and with an ad-hoc algorithm, whose complexity is polynomial. Then proper...
متن کامل